Michael Mitzenmacher - PDFSEARCH.IO - Document Search Engine

Michael Mitzenmacher
Results: 37

#	Item
11	Peeling Arguments Inver0ble Bloom Lookup Tables and Biﬀ Codes Michael Mitzenmacher Beginning Add to Reading List Source URL: mmds-data.org Language: English - Date: 2016-03-09 01:30:04 Graph theory Combinatorial optimization Matching Graph Clause
12	The Asymptotics of Selecting the Shortest of Two, Improved Michael Mitzenmacher Berhold Vocking y Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2002-01-28 14:06:55 Mathematical analysis Expected value Pi
13	Dynamic Models for File Sizes and Double Pareto Distributions Michael Mitzenmacher∗ Harvard University Abstract Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2002-02-01 14:41:53 Statistics Mathematical analysis Probability Probability distributions Actuarial science Power laws Normal distribution Log-normal distribution Pareto distribution Exponentials Heavy-tailed distribution Central limit theorem
14	Load Balancing and Density Dependent Jump Markov Processes EXTENDED ABSTRACT Michael Mitzenmacher Department of Computer Science U.C. Berkeley Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2002-01-28 14:05:03 Probability theory Stochastic processes Probability Mathematical analysis Markov processes Markov models Queueing theory Network performance Markov chain Dynamical system Expected value Normal distribution
15	Variations on Random Graph Models for the Web Eleni Drinea Mihaela Enachescu Michael Mitzenmacher Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2002-01-28 14:10:19 Mathematics Graph theory Discrete mathematics PageRank Vertex Graph Ear decomposition Almost surely Network science Centrality
16	Bounds and Improvements for BiBa Signature Schemes Michael Mitzenmacher and Adrian Perrig Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2002-02-08 16:53:24 Cryptography Public-key cryptography Balls into bins Bin Digital signature Powerball
17	The Power of Two Choices in Randomized Load Balancing by Michael David Mitzenmacher B.A. (Harvard UniversityA dissertation submitted in partial satisfaction of the requirements for the degree of Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2002-01-28 14:08:50 Stochastic processes Economy Customer experience management Network performance Operations research Queueing theory Load balancing Business Computing
18	Load Balancing with Memory Michael Mitzenmacher∗ Balaji Prabhakar † Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2002-07-08 11:25:19 Mathematical analysis Markov processes Markov models Stochastic processes Graph theory Markov chain Queueing theory Pi Exponentiation
19	The Power of Two Choices in Randomized Load Balancing by Michael David Mitzenmacher B.A. (Harvard UniversityA dissertation submitted in partial satisfaction of the requirements for the degree of Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2003-09-23 16:53:28
20	Internet Mathematics Vol. 1, No. 4: Network Applications of Bloom Filters: A Survey Andrei Broder and Michael Mitzenmacher Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2005-10-10 17:12:02